VLSI algorithm

См. также в других словарях:

• Memetic algorithm — Memetic algorithms (MA) represent one of the recent growing areas of research in evolutionary computation. The term MA is now widely used as a synergy of evolutionary or any population based approach with separate individual learning or local… …   Wikipedia

• Lee algorithm — The Lee algorithm is one possible solution for maze routing problems.1) Initialisation Select start point, mark with 0 i := 02) Wave expansion REPEAT Mark all unlabeled neighbors of points marked with i with i+1 i := i+1 UNTIL ((target reached)… …   Wikipedia

• HSL and HSV — Fig. 1. HSL (a–d) and HSV (e–h). Above (a, e): cut away 3D models of each. Below: two dimensional plots showing two of a model’s three parameters at once, holding the other constant: cylindrical shells (b, f) of constant saturation, in this case… …   Wikipedia

• IDEA — У этого термина существуют и другие значения, см. IDEA (значения). IDEA, International Data Encryption Algorithm …   Википедия

• 2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… …   Wikipedia

• CORDIC — Trigonometry History Usage Functions Generalized Inverse functions Further reading …   Wikipedia

• Cellular neural network — Cellular neural networks (CNN) are a parallel computing paradigm similar to neural networks, with the difference that communication is allowed between neighbouring units only. Typical applications include image processing, analyzing 3D surfaces,… …   Wikipedia

• Parallel computing — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computing …   Wikipedia

• High-level synthesis — (HLS), sometimes referred to as C synthesis, electronic system level (ESL) synthesis, algorithmic synthesis, or behavioral synthesis, is an automated design process that interprets an algorithmic description of a desired behavior and creates… …   Wikipedia

• Largest empty rectangle — In computational geometry, the largest empty rectangle problem,[1] maximal empty rectangle problem[2] or maximum empty rectangle problem,[3] is the problem of finding a rectangle of maximal size to be placed among obstacles in the plane. There… …   Wikipedia

• Adel Sedra — is an Egyptian electrical engineer whose research specialization is microelectronics, with particular emphasis on applications in communication and instrumentation systems. He received his bachelor of science in electrical engineering from Cairo… …   Wikipedia